On Popular Random Assignments
نویسندگان
چکیده
One of the most fundamental and ubiquitous problems in microeconomics and operations research is how to assign objects to agents based on their individual preferences. An assignment is called popular if there is no other assignment that is preferred by a majority of the agents. Popular assignments need not exist, but the minimax theorem implies the existence of a popular random assignment. In this paper, we study the compatibility of popularity with other properties that have been considered in the literature on random assignments, namely efficiency, equal treatment of equals, envy-freeness, and strategyproofness.
منابع مشابه
Majority Graphs of Assignment Problems and Properties of Popular Random Assignments
Randomized mechanisms for assigning objects to individual agents have received increasing attention by computer scientists as well as economists. In this paper, we study a property of random assignments, called popularity, which corresponds to the well-known notion of Condorcet-consistency in social choice theory. Our contribution is threefold. First, we define a simple condition that character...
متن کاملWrting to learn (WTL) the effects of written assignments on students learning and writing skills
This research aims to develop a model based on writing to learn (WTL) and the effective on promotion of learning and writing skills of students. Therefore, use the nonequivalent control group design with pre- test and post- test. 115 of the undergraduate students of Education University were assigned at random in three groups: Group 1 (short writing assignments), group 2 (analytical essay), and...
متن کاملGeometric properties of satisfying assignments of random epsilon-1-in-k SAT
We study the geometric structure of the set of solutions of random ǫ-1-in-k SAT problem [2, 15]. For l ≥ 1, two satisfying assignments A and B are l-connected if there exists a sequence of satisfying assignments connecting them by changing at most l bits at a time. We first prove that w.h.p. two assignments of a random ǫ-1-in-k SAT instance are O(log n)-connected, conditional on being satisfyin...
متن کاملPartial Optimality of Dual Decomposition for MAP Inference in Pairwise MRFs
Markov random fields (MRFs) are a powerful tool for modelling statistical dependencies for a set of random variables using a graphical representation. An important computational problem related to MRFs, called maximum a posteriori (MAP) inference, is finding a joint variable assignment with the maximal probability. It is well known that the two popular optimisation techniques for this task, lin...
متن کاملMinimax-optimal Inference from Partial Rankings
This paper studies the problem of rank aggregation under the Plackett-Luce model. The goal is to infer a global ranking and related scores of the items, based on partial rankings provided by multiple users over multiple subsets of items. A question of particular interest is how to optimally assign items to users for ranking and how many item assignments are needed to achieve a target estimation...
متن کامل